Comparator networks for binary heap construction

Comparator Networks for Binary Heap Construction

Comparator networks for constructing binary heaps of size n are presented which have size O(n log log n) and depth O(log n). A lower bound of n log log n ?O(n) for the size of any heap construction network is also proven, implying that the networks presented are within a constant factor of optimal. We give a tight relation between the leading constants in the size of selection networks and in t...

Comparator Networks for Binary

On sequential construction of binary neural networks

A new technique called sequential window learning (SWL), for the construction of two-layer perceptrons with binary inputs is presented. It generates the number of hidden neurons together with the correct values for the weights, starting from any binary training set. The introduction of a new type of neuron, having a window-shaped activation function, considerably increases the convergence speed...

A High-Speed 64-Bit Binary Comparator

A high-speed 64-bit binary comparator is proposed in this brief. Comparison is most basic arithmetic operation that determines if one number is greater than, equal to, or less than the other number. Comparator is most fundamental component that performs comparison operation. This brief presents comparison of modified and existing 64-bit binary comparator designs concentrating on delay. Means so...

Periodic comparator networks

We survey recent results on periodic algorithms. We focus on the problems of sorting, merging and permuting and concentrate on algorithms that have small constant periods.